Automatic Graph Transformation in System Verification
نویسندگان
چکیده
The use of formal verification methods is essential in the design process of dependable computer controlled systems. A complex environment should support the semiformal specification as well as the formal verification of the desired system. The efficiency of applying these formal methods will be highly increased if the underlying mathematical background is hidden from the designer. In such an integrated system effective techniques are needed to transform the system model to different sort of mathematical models supporting the assessment of system characteristics. The current paper introduces our research results towards a general-purpose model transformation engine. This approach results in yielding a provenly correct and complete transformation code by combining the powerful techniques of graph transformation, planner algorithms and deductive databases.
منابع مشابه
A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملUml Diagrams Using Graph Transformation
UML is considered as the standard for object-oriented modelling language adopted by the Object Management Group. However, UML has been criticized due to the lack of formal semantics and the ambiguity of its models. In other hands, UML models can be mathematically verified and checked by using its equivalent formal representation. So, in this paper, we propose an approach and a tool based on gra...
متن کاملTowards the Automatic Verification of Behavior Preservation at the Transformation Level for Operational Model Transformations
The correctness of model transformations and, in particular, behavior preservation is important for model-driven engineering of high quality software. Behavior preservation verification techniques have been presented with automatic tool support for the instance level, i.e. for a given source and target model specified by the model transformation. However, up until now there is no automatic veri...
متن کاملTowards a Verification Framework for Haskell by Combining Graph Transformation Units and SAT Solving
The development of correct software systems is of highest relevance in software engineering. Various methods have been applied to gain this goal like theorem provers, exhaustive tests, or algebraic specification techniques. In this paper, we propose a new approach for the automatic verification of Haskell programs by combining graph transformation units and SAT solving. Therefor, function equat...
متن کاملENTROPY OF DYNAMICAL SYSTEMS ON WEIGHTS OF A GRAPH
Let $G$ be a finite simple graph whose vertices and edges are weighted by two functions. In this paper we shall define and calculate entropy of a dynamical system on weights of the graph $G$, by using the weights of vertices and edges of $G$. We examine the conditions under which entropy of the dynamical system is zero, possitive or $+infty$. At the end it is shown that, for $rin [0,+infty]$, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000